Rendezvous of heterogeneous mobile agents in edge-weighted networks
نویسندگان
چکیده
منابع مشابه
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is una...
متن کاملRendezvous of Mobile Agents in Anonymous Networks with Faulty Channels∗
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (asynchronous anonymous multi-agent) rendezvous problem has been studied extensively but only for networks that are safe or fault-free. In this paper, we consider the case when some of the edges in the network are dange...
متن کاملRendezvous of Mobile Agents in Directed Graphs
We study the problem of gathering at the same location two mobile agents that are dispersed in an unknown and unlabeled environment. This problem called Rendezvous, is a fundamental task in distributed coordination among autonomous entities. Most previous studies on the subject model the environment as an undirected graph and the solution techniques rely heavily on the fact that an agent can ba...
متن کاملOn Rendezvous in Mobile Sensing Networks
A rendezvous is a temporal and spatial vicinity of two sensors. In this paper, we investigate rendezvous in the context of mobile sensing systems. We use an air quality dataset obtained with the OpenSense monitoring network to explore rendezvous properties for carbon monoxide, ozone, temperature, and humidity processes. Temporal and spatial locality of a physical process impacts the number of r...
متن کاملMobile Agents in Heterogeneous Networks: A Look on Performance
Mobile agents can be seen as a new paradigm for distributed computing. One characteristic of mobile agents is their autonomy and pro-activity. This article present a framework designed on top of PMADE (Platform for Mobile Agent Distribution and Execution) to support our research in this domain. Our framework consists of three modules. The Map Module collects information on the available network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.05.055